The theorem of Fine and Wilf for relational periods
نویسندگان
چکیده
We consider relational periods, where the relation is a compatibility relation on words induced by a relation on letters. We prove a variant of the theorem of Fine and Wilf for a (pure) period and a relational period.
منابع مشابه
Relational Fine and Wilf words
We consider interaction properties of relational periods, where the relation is a compatibility relation on words induced by a relation on letters. By the famous theorem of Fine and Wilf, p + q − gcd(p, q) − 1 is the maximal length of a word having periods p and q but not period gcd(p, q). Such words of maximal length are called extremal Fine and Wilf words. In this paper we study properties of...
متن کاملInteraction Properties of Relational Periods
Similarity relations, i.e., compatibility relations on words induced by relations on letters were introduced as a generalization of partial words in [9](i). There and in [10, 11] the main focus was on the effect of these relations on coding properties and on the defect theorem of words. In the article [8] we started the study of the interaction properties of periods with respect to similarity r...
متن کاملAbelian periods, partial words, and an extension of a theorem of Fine and Wilf
Recently, Constantinescu and Ilie proved a variant of the wellknown periodicity theorem of Fine and Wilf in the case of two relatively prime abelian periods and conjectured a result for the case of two nonrelatively prime abelian periods. In this paper, we answer some open problems they suggested. We show that their conjecture is false but we give bounds, that depend on the two abelian periods,...
متن کاملFine-wilf Graphs and the Generalized Fine-wilf Theorem
The Fine-Wilf theorem was generalized to finite sequences with three periods by M. G. Castelli, F. Mignosi, and A. Restivo. They introduced a function f from the set of all ordered triples of nonnegative integers to the set of positive integers which was critical to their analysis, and they introduced the graphs that we shall refer to as Fine-Wilf graphs. The work of Castelli et al. was general...
متن کاملFine and Wilf’s Theorem for Abelian Periods in Partial Words
Recently, Constantinescu and Ilie proved a variant of the well-known periodicity theorem of Fine and Wilf in the case of two relatively prime abelian periods, and conjectured a result for the case of two non-relatively prime abelian periods. More precisely, they proved that any full word having two coprime abelian periods p, q and length at least 2pq− 1 has also gcd(p, q) = 1 as a period. In th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- ITA
دوره 43 شماره
صفحات -
تاریخ انتشار 2009